|
In mathematical logic, a redundant proof is a proof that has a subset that is a shorter proof of the same result. That is, a proof of is considered redundant if there exists another proof of such that (i.e. ) and where is the number of nodes in .〔Fontaine, Pascal; Merz, Stephan; Woltzenlogel Paleo, Bruno. ''Compression of Propositional Resolution Proofs via Partial Regularization''. 23rd International Conference on Automated Deduction, 2011.〕 == Local redundancy == A proof containing a subproof of the shapes (here omitted pivots indicate that the resolvents must be uniquely defined) : is locally redundant. Indeed, both of these subproofs can be equivalently replaced by the shorter subproof . In the case of local redundancy, the pairs of redundant inferences having the same pivot occur close to each other in the proof. However, redundant inferences can also occur far apart in the proof. The following definition generalizes local redundancy by considering inferences with the same pivot that occur within different contexts. We write to denote a proof-context with a single placeholder replaced by the subproof . 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「redundant proof」の詳細全文を読む スポンサード リンク
|